Symbolic computation with finite quandles
نویسندگان
چکیده
منابع مشابه
Symbolic computation with finite quandles
Algorithms are described and Maple implementations are provided for finding all quandles of order n, as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of these programs work for arbitrary binary operation tables and hence algebraic ...
متن کاملSymbolic computation with finite biquandles
A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Zp from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملClassification of Finite Alexander Quandles
Two finite Alexander quandles with the same number of elements are isomorphic iff their Z[t]-submodules Im(1 − t) are isomorphic as modules. This yields specific conditions on when Alexander quandles of the form Zn[t ]/(t − a) where gcd(n, a) = 1 (called linear quandles) are isomorphic, as well as specific conditions on when two linear quandles are dual and which linear quandles are connected. ...
متن کاملOptimised finite difference computation from symbolic equations
Domain-specific high-productivity environments are playing an increasingly important role in scientific computing due to the levels of abstraction and automation they provide. In this paper we introduce Devito, an opensource domain-specific framework for solving partial differential equations from symbolic problem definitions by the finite difference method. We highlight the generation and auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2006
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2006.03.002